<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 9595 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
<a href="http://www.iis7.com" target="_blank" style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;" id="22fac3a38bd0465b90d15d2d08e846a6">iis7站长之家</a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a class="nav-link" href="/user/login/index.html"> 登录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 9595 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/hqztrue/index.html'> hqztrue </a> </td>
<td> <a href='/problem/1004/index.html'> 1004. 【模板题】高精度乘法 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 364.592 ms </td>
<td style='font-size:13px'> 42 MB + 616 KB </td>
<td style='font-size:13px'> C++ </td>
<td style='font-size:13px'> 4.53 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2019-06-16 20:37:06 </td>
<td style='font-size:13px'> 2019-06-16 20:37:08 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">#pragma GCC optimize(&quot;Ofast&quot;)
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;math.h&gt;
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define PI 3.14159265358979323846
template &lt;class T&gt;
inline void swap(T &amp;a, T &amp;b)
{
	T t=a;
	a=b,b=t;
}
namespace IO
{
	const int BUF_SIZE=1&lt;&lt;15;
	char in_buf[BUF_SIZE],out_buf[BUF_SIZE];
	char *p_in_buf=in_buf+BUF_SIZE;
	char *p_out_buf=out_buf;
	inline char get_char()
	{
		if (p_in_buf==in_buf+BUF_SIZE) fread(in_buf,1,BUF_SIZE,stdin),p_in_buf=in_buf;
		return *(p_in_buf++);
	}
	inline void put_char(char x)
	{
		if (p_out_buf==out_buf+BUF_SIZE) fwrite(out_buf,1,BUF_SIZE, stdout),p_out_buf=out_buf;
		*(p_out_buf++)=x;
	}
	inline void flush()
	{
		if (p_out_buf != out_buf) fwrite(out_buf,1,p_out_buf-out_buf,stdout),p_out_buf=out_buf;
	}
}
#define getchar() IO::get_char()
#define putchar(x) IO::put_char(x)
inline int getint()
{
	int x=0;
	char c=getchar();
	while(c&lt;=32) c=getchar();
	while(c&gt;32) x=x*10+(c&amp;15),c=getchar();
	return x;
}
inline int getint(char &amp;c)
{
	int x=0;
	c=getchar();
	while(c&lt;=32) c=getchar();
	while(c&gt;32) x=x*10+(c&amp;15),c=getchar();
	return x;
}
template &lt;class T&gt;
inline void _putint(T x)
{
	return x?_putint(x/10), putchar((x%10)+48),void():void();
}
template &lt;class T&gt;
inline void putint(T x)
{
	return x==0?putchar(&#x27;0&#x27;),void():_putint(x),void();
}
inline void getline(char *s)
{
	char c=getchar();
	while(c==&#x27;\n&#x27;) c=getchar();
	while(c!=&#x27;\n&#x27;) *(s++)=c,c=getchar();
	*s=0;
}
// ==== header ====
#define float double
struct Complex
{
	float x,y;
	Complex conj()
	{
		return (Complex){x,-y};
	}
	Complex conj2()
	{
		return (Complex){-x,y};
	}
};
inline Complex operator + (const Complex &amp;a,const Complex &amp;b)
{
	return (Complex){a.x+b.x,a.y+b.y};
}
inline Complex operator - (const Complex &amp;a,const Complex &amp;b)
{
	return (Complex){a.x-b.x,a.y-b.y};
}
inline Complex operator * (const Complex &amp;a,const Complex &amp;b)
{
	return (Complex){a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x};
}
Complex A[(1&lt;&lt;21)|1], B[(1&lt;&lt;21)|1];
int bitrev[1&lt;&lt;11];
void bitrev_init()
{
	for(register int i=0;i&lt;1&lt;&lt;11;i++)
	{
		int t=0;
		for(register int j=0;j&lt;11;j++) t|=((i&gt;&gt;j)&amp;1)&lt;&lt;(10-j);
		bitrev[i]=t;
	}
}
inline int get_bitrev(int x,int len)
{
	return (bitrev[x&gt;&gt;11]|(bitrev[x&amp;((1&lt;&lt;11)-1)]&lt;&lt;11))&gt;&gt;(22-len);
}
void FFT(Complex *a,int lg_n,bool rev)
{
	int n=1&lt;&lt;lg_n;
	for(register int i=lg_n-1;i&gt;=0;i--)
	{
		int S=1&lt;&lt;i;
		Complex w1=(Complex){cos(PI/S),-sin(PI/S)*(rev?-1:1)};
		for(register int j=0;j&lt;n;j+=S&lt;&lt;1)
		{
			Complex w=(Complex){1.0,0.0};
			Complex *A=a+j;
			for(register int k=0;k&lt;S;k++)
			{
				Complex t=A[k+S];
				A[k+S]=(A[k]-t)*w,A[k]=A[k]+t,w=w*w1;
			}
		}
	}
	for(register int i=0;i&lt;n;i++)
	{
		int t=get_bitrev(i,lg_n);
		if(i&lt;t)
		{
			Complex tmp=a[i];
			a[i]=a[t],a[t]=tmp;
		}
	}
}
void FFT(Complex *a,Complex *b,int lg_n,bool rev)
{
	int n=1&lt;&lt;lg_n;
	for(register int i=lg_n-1;i&gt;=0;i--)
	{
		int S=1&lt;&lt;i;
		Complex w1=(Complex){cos(PI/S),-sin(PI/S)*(rev?-1:1)};
		for(register int j=0;j&lt;n;j+=S&lt;&lt;1)
		{
			Complex w=(Complex){1.0,0.0};
			Complex *A=a+j,*B=b+j;
			for(register int k=0;k&lt;S;k++)
			{
				Complex ta=A[k+S],tb=B[k+S];
				A[k+S]=(A[k]-ta)*w,B[k+S]=(B[k]-tb)*w,A[k]=A[k]+ta,B[k]=B[k]+tb,w=w*w1;
			}
		}
	}
	for(register int i=0;i&lt;n;i++)
	{
		int t=get_bitrev(i,lg_n);
		if(i&lt;t)
		{
			Complex tmp=a[i];
			a[i]=a[t],a[t]=tmp,tmp=b[i],b[i]=b[t],b[t]=tmp;
		}
	}
}
char in_s[(1&lt;&lt;20)|10];
int main()
{
	int n,m;
	n=m=999999;
	int lg_n=3;
	while(1&lt;&lt;lg_n&lt;n+1||1&lt;&lt;lg_n&lt;m+1) ++lg_n;
	bitrev_init();
	int N=1&lt;&lt;lg_n;
	int N2=N&gt;&gt;1;
	getline(in_s);
	for(register int i=0;i&lt;=n;i++)
	{
		// *0.5 is to avoid *2 in later caclulation
		(i&amp;1?A[i&gt;&gt;1].y:A[i&gt;&gt;1].x)=(in_s[n-i]-48)*0.5;
	}
	getline(in_s);
	for(register int i=0;i&lt;=m;i++)
	{
		(i&amp;1?B[i&gt;&gt;1].y:B[i&gt;&gt;1].x)=(in_s[m-i]-48)*0.5;
	}
	FFT(A,B,lg_n,false),A[N]=A[0],B[N]=B[0];
	const Complex w=(Complex){cos(2*PI/N),sin(2*PI/N)};
	Complex w_product=(Complex){1,0};
	for(register int i=0;i&lt;=N2;i++)
	{
		Complex a1=A[i]+A[N-i],a2=A[i]-A[N-i],b1=B[i]+B[N-i],b2=B[i]-B[N-i];
		Complex a=(Complex){a1.x,a2.y},b=(Complex){a2.x,a1.y},c=(Complex){b1.x,b2.y},d=(Complex){b2.x,b1.y};
		// a * c - b * d * delta(x - 1) + a * d + b * c
		// @Signal Processing
		A[i]=a*c+a*d+b*c-b*d*w_product.conj(),A[N - i]=(a*c).conj()+a.conj()*d.conj2()+b.conj2()*c.conj()-b.conj2()*d.conj2()*w_product,w_product=w_product*w;
	}
	FFT(A,lg_n,true);
	float inv_n=1.0/N;
	int ans[2000005];
	for(register int i=0;i&lt;=n+m;i++)
	{
		ans[i]=(int)((i&amp;1?A[i&gt;&gt;1].y:A[i&gt;&gt;1].x)*inv_n+0.5);
	}
	ans[n+m+1]=0;
	for(int i=0;i&lt;=n+m;i++) ans[i+1]+=ans[i]/10,ans[i]=ans[i]%10;
	int i=n+m+1;
	while(!ans[i]) i--;
	while(i&gt;=0) putchar(ans[i]|48),i--;
	IO::flush();
}
</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_1" aria-expanded="false" aria-controls="detail_1">显示更多</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">364.592 ms</td><td class="col-xs-2" style="vertical-align:middle">42 MB + 616 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 100</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_2" aria-expanded="false" aria-controls="detail_2">显示更多</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 364.591802
mem_kb = 43624
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:12:36 | Loaded in 1 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
